Combinatorics of Linked Systems of Quartet Trees
نویسندگان
چکیده
We apply classical quartet techniques to the problem of phylogenetic decisiveness and find a value k such that all collections of at least k quartets are decisive. Moreover, we prove that this bound is optimal and give a lower-bound on the probability that a collection of quartets is decisive.
منابع مشابه
Quartet Compatibility and the Quartet Graph
A collection P of phylogenetic trees is compatible if there exists a single phylogenetic tree that displays each of the trees in P. Despite its computational difficulty, determining the compatibility of P is a fundamental task in evolutionary biology. Characterizations in terms of chordal graphs have been previously given for this problem as well as for the closely-related problems of (i) deter...
متن کاملComputing the Quartet Distance Between Trees of Arbitrary Degree
We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number of quartets—sub-trees induced by four leaves—that differs between the trees. Previous algorithms focus on computing the quartet distance between binary trees. In this paper, we present two algorithms for computing the quartet ...
متن کاملQDist-quartet distance between evolutionary trees
SUMMARY QDist is a program for computing the quartet distance between two unrooted trees, i.e. the number of quartet topology differences between the trees, where a quartet topology is the topological subtree induced by four species. The program is based on an algorithm with running time O(n log2 n), which makes it practical to compare large trees. Available under GNU license. AVAILABILITY ht...
متن کاملAlgorithms for Computing the Quartet Distance
Evolutionary (Phylogenetic) trees are constructs of the biological and medical sciences, their purpose is to establish the relationship between a set of species (phyla). Often it is the case that the true evolutionary tree is unknown and one can only try to estimate it. Reconstruction methods are manifold and the resulting evolutionary trees are not guaranteed to be correct. In order to establi...
متن کاملComputing the Quartet Distance Between Trees of Arbitrary Degrees
Comparing trees with regard to their topology is in itself an interesting theoretical problem in computer science, and furthermore researchers working in the interdisciplinary field of computational biology need tools to compare phylogenetic trees, i.e. trees that describe the relation of species according to evolutionary history. Different methods and different information can result in differ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014